Restricted Minimum Critical Mass

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimum Restricted Diameter Spanning Trees

Let G = (V,E) be a requirements graph. Let d = (dij)i,j=1 be a length metric. For a tree T denote by dT (i, j) the distance between i and j in T (the length according to d of the unique i − j path in T ). The restricted diameter of T , DT , is the maximum distance in T between pair of vertices with requirement between them. The minimum restricted diameter spanning tree problem is to find a span...

متن کامل

Dirac's minimum degree condition restricted to claws

Let G be a graph on n t> 3 vertices. Dirac's minimum degree condition is the condition that all vertices of G have degree at least in. This is a well-known sufficient condition for the existence of a Hamilton cycle in G. We give related sufficiency conditions for the existence of a Hamilton cycle or a perfect matching involving a restriction of Dirac's minimum degree condition to certain subset...

متن کامل

Minimum Critical Exponents for Palindromes

We determine the minimum possible critical exponent for all palindromes over finite alphabets.

متن کامل

Critical parameters of the restricted primitive model

The critical parameters for the restricted primitive model of electrolyte solutions were determined from extensive grand canonical Monte Carlo simulations combined with mixed-field finite-size scaling. The fine-lattice discretization method was used for the calculations, with Ewald summation of the long-range coulombic forces. Ising criticality and no pressure mixing were assumed in the finite-...

متن کامل

Critical Graphs for Minimum Vertex Cover

An α-critical graph is an instance where the deletion of any element would decrease some graph’s measure α. Such instances have shown to be interesting objects of study for deepen the understanding of optimization problems. This work explores critical graphs in the context of the Minimum-Vertex-Cover problem. We demonstrate their potential for the generation of larger graphs with hidden a prior...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nuclear Science and Engineering

سال: 1959

ISSN: 0029-5639,1943-748X

DOI: 10.13182/nse59-a25576